Robust Privacy-Utility Tradeoffs under Differential Privacy and Hamming Distortion

نویسنده

  • Kousha Kalantari
چکیده

A privacy utility tradeoff is developed for any arbitrary set of finite-alphabet source distributions. Privacy is quantified using differential privacy (DP), and utility is quantified using expected Hamming distortion maximized over the set of distributions. The family of source distribution sets (source sets) is categorized into three classes, based on different levels of prior knowledge they capture: (i) for Class I source sets, defined as sets whose convex hull includes the uniform point, the optimal DP mechanism is shown to be symmetric; (ii) for Class II source sets, comprised of distributions that are not in Class I and are restricted to have an order imposed on the distribution, the optimal mechanism is shown to exploit the source knowledge to provide more privacy to the outliers; and (iii) for all remaining source sets, which are neither Class I nor Class II, henceforth defined as Class III, bounds on optimal leakage are developed; these bounds are shown to be tight for Class III sets satisfying a specific property. To get a better understanding of DP under Hamming distortion, numerical comparisons to information theoretic leakage is provided, and analytical comparisons are developed for specific distortion ranges. Index Terms Utility-privacy tradeoff, differential privacy, information leakage, Hamming distortion

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Privacy-Utility Tradeoffs under Constrained Data Release Mechanisms

Privacy-preserving data release mechanisms aim to simultaneously minimize information-leakage with respect to sensitive data and distortion with respect to useful data. Dependencies between sensitive and useful data results in a privacy-utility tradeoff that has strong connections to generalized rate-distortion problems. In this work, we study how the optimal privacy-utility tradeoff region is ...

متن کامل

The Optimal Differential Privacy Mechanism under Hamming Distortion for Universal Memoryless Source Classes

To be considered for the 2016 IEEE Jack Keil Wolf ISIT Student Paper Award. We develop the tradeoff between privacy, quantified using local differential privacy (L-DP), and utility, quantified using Hamming distortion, for specific classes of universal memoryless finite-alphabet sources. In particular, for the class of permutation invariant sources (i.e., sources whose distributions are invaria...

متن کامل

Differentially Private Local Electricity Markets

Privacy-preserving electricity markets have a key role in steering customers towards participation in local electricity markets by guarantying to protect their sensitive information. Moreover, these markets make it possible to statically release and share the market outputs for social good. This paper aims to design a market for local energy communities by implementing Differential Privacy (DP)...

متن کامل

Privacy Games: Optimal User-Centric Data Obfuscation

Consider users who share their data (e.g., location) with an untrusted service provider to obtain a personalized (e.g., location-based) service. Data obfuscation is a prevalent user-centric approach to protecting users’ privacy in such systems: the untrusted entity only receives a noisy version of user’s data. Perturbing data before sharing it, however, comes at the price of the users’ utility ...

متن کامل

Dynamic Privacy For Distributed Machine Learning Over Network

Privacy-preserving distributed machine learning becomes increasingly important due to the recent rapid growth of data. This paper focuses on a class of regularized empirical risk minimization (ERM) machine learning problems, and develops two methods to provide differential privacy to distributed learning algorithms over a network. We first decentralize the learning algorithm using the alternati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017